package sortByCategory.BinarySearch;

/**
 * @author haiboWu
 * @create 2020-03-08 15:02
 */
public class No_153_FindMin {
    public int findMin(int[] nums) {
        int left=0,right=nums.length-1;
        while (left<right){
            int mid=left+(right-left)/2;
            if(nums[mid]<nums[right]){
                right=mid;
            }else{
                left=mid+1;
            }
        }
        return nums[left];
    }
}
